The bounds of the eigenvalues for rank-one modification of Hermitian matrix

نویسندگان

  • Guang-hui Cheng
  • Zhida Song
  • Jianfeng Yang
  • Jia Si
چکیده

The eigenproblems of the rank-one updates of the matrices have lots of applications in scientific computation and engineering such as the symmetric tridiagonal eigenproblems by the divide-andconquer method and Web search engine. Many researchers have well studied the algorithms for computing eigenvalues of Hermitian matrices updated by a rank-one matrix [1–6]. Recently, Ding and Zhou studied a spectral perturbation theorem for rank-one updated matrices of special structure in [7] and considered two applications. Cheng, Luo, and Li considered the bounds of the smallest and largest eigenvalues for rank-one modification of Hermitian matrices [8]. Eigenvalue bounds for perturbations of Hermitian matrices have been considered by Ipsen and Nadler in [9]. In this paper, we consider the bounds of the eigenvalues for rank-one modification of Hermitian matrices. The ideas of this paper were mainly motivated by one of [9]. We study the following form

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Refined Perturbation Bounds for Eigenvalues of Hermitian and Non-Hermitian Matrices

We present eigenvalue bounds for perturbations of Hermitian matrices, and express the change in eigenvalues in terms of a projection of the perturbation onto a particular eigenspace, rather than in terms of the full perturbation. The perturbations we consider are Hermitian of rank one, and Hermitian or non-Hermitian with norm smaller than the spectral gap of a specific eigenvalue. Applications ...

متن کامل

Convergence Properties of Hermitian and Skew Hermitian Splitting Methods

In this paper we consider the solutions of linear systems of saddle point problems‎. ‎By using the spectrum of a quadratic matrix polynomial‎, ‎we study the eigenvalues of the iterative matrix of the Hermitian and skew Hermitian splitting method‎.

متن کامل

Computing the Matrix Geometric Mean of Two HPD Matrices: A Stable Iterative Method

A new iteration scheme for computing the sign of a matrix which has no pure imaginary eigenvalues is presented. Then, by applying a well-known identity in matrix functions theory, an algorithm for computing the geometric mean of two Hermitian positive definite matrices is constructed. Moreover, another efficient algorithm for this purpose is derived free from the computation of principal matrix...

متن کامل

Investigation on the Hermitian matrix expression‎ ‎subject to some consistent equations

In this paper‎, ‎we study the extremal‎ ‎ranks and inertias of the Hermitian matrix expression $$‎ ‎f(X,Y)=C_{4}-B_{4}Y-(B_{4}Y)^{*}-A_{4}XA_{4}^{*},$$ where $C_{4}$ is‎ ‎Hermitian‎, ‎$*$ denotes the conjugate transpose‎, ‎$X$ and $Y$ satisfy‎ ‎the following consistent system of matrix equations $A_{3}Y=C_{3}‎, ‎A_{1}X=C_{1},XB_{1}=D_{1},A_{2}XA_{2}^{*}=C_{2},X=X^{*}.$ As‎ ‎consequences‎, ‎we g...

متن کامل

Some remarks on the sum of the inverse values of the normalized signless Laplacian eigenvalues of graphs

Let G=(V,E), $V={v_1,v_2,ldots,v_n}$, be a simple connected graph with $%n$ vertices, $m$ edges and a sequence of vertex degrees $d_1geqd_2geqcdotsgeq d_n>0$, $d_i=d(v_i)$. Let ${A}=(a_{ij})_{ntimes n}$ and ${%D}=mathrm{diag }(d_1,d_2,ldots , d_n)$ be the adjacency and the diagonaldegree matrix of $G$, respectively. Denote by ${mathcal{L}^+}(G)={D}^{-1/2}(D+A) {D}^{-1/2}$ the normalized signles...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Numerical Lin. Alg. with Applic.

دوره 21  شماره 

صفحات  -

تاریخ انتشار 2014